On Irregular Colorings of Unicyclic Graph Family
نویسندگان
چکیده
Irregular coloring is a proper and each vertex on graph must have different code. The color code of v where the number vertices that are adjacent to colored i. minimum k-color used in irregular called chromatic denoted by . In this paper, we discuss for bull graph, pan sun peach caveman graph.
منابع مشابه
On Irregular Colorings of Graphs
For a graph G and a proper coloring c : V (G) → {1, 2, . . . , k} of the vertices of G for some positive integer k , the color code of a vertex v of G (with respect to c ) is the ordered (k + 1) -tuple code(v) = (a0, a1, . . . , ak) where a0 is the color assigned to v and for 1 ≤ i ≤ k , ai is the number of vertices adjacent to v that are colored i . The coloring c is irregular if distinct vert...
متن کاملOn the Core of a Unicyclic Graph
A set S ⊆ V is independent in a graph G = (V,E) if no two vertices from S are adjacent. By core(G) we mean the intersection of all maximum independent sets. The independence number α(G) is the cardinality of a maximum independent set, while μ(G) is the size of a maximum matching in G. A connected graph having only one cycle, say C, is a unicyclic graph. In this paper we prove that if G is a uni...
متن کاملIrregular colorings of regular graphs
An irregular coloring of a graph is a proper vertex coloring that distinguishes vertices in the graph either by their own colors or by the colors of their neighbors. In algebraic graph theory, graphs with a certain amount of symmetry can sometimes be specified in terms of a group and a smaller graph called a voltage graph. In [3], Radcliffe and Zhang found a bound for the irregular chromatic nu...
متن کاملOn colorings of graph powers
In this paper, some results concerning the colorings of graph powers are presented. The notion of helical graphs is introduced. We show that such graphs are hom-universal with respect to high odd-girth graphs whose (2t+1)st power is bounded by a Kneser graph. Also, we consider the problem of existence of homomorphism to odd cycles. We prove that such homomorphism to a (2k+1)cycle exists if and ...
متن کاملOn colorings of graph fractional powers
For any k ∈ N, the k−subdivision of graph G is a simple graph G 1 k , which is constructed by replacing each edge of G with a path of length k. In this paper we introduce the mth power of the n−subdivision of G, as a fractional power of G, denoted by G m n . In this regard, we investigate chromatic number and clique number of fractional power of graphs. Also, we conjecture that χ(G m n ) = ω(G ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cauchy
سال: 2023
ISSN: ['2477-3344', '2086-0382']
DOI: https://doi.org/10.18860/ca.v7i4.16917